/*
 * You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a linked list.
 * Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
 * Output: 7 -> 0 -> 8
 */
#include <stdio.h>

struct ListNode {
    int val;
    ListNode *next;
    ListNode(int x) : val(x), next(NULL) {
    }
};

class Solution {
public:
    ListNode *addTwoNumbers(ListNode *l1, ListNode *l2) {
        int carrier = 0;
        ListNode *head = NULL, *prev = NULL, **curr = &head;
        while (l1 || l2) {
            int v = carrier;
            if (l1) {
                v += l1->val;
                l1 = l1->next;
            }
            if (l2) {
                v += l2->val;
                l2 = l2->next;
            }
            carrier = v/10;
            *curr = new ListNode(v%10);
            prev = *curr;
            curr = &((*curr)->next);
            prev->next = *curr;
        }
        if (carrier) {
            *curr = new ListNode(carrier);
        }
        return head;
    }
};

int main() {
    return 0;
}
